Performance Evaluation of Simple K-Mean and Parallel K-Mean Clustering Algorithms: Big Data Business Process Management Concept

نویسندگان

چکیده

Data is the most valuable asset in any firm. As time passes, data expands at a breakneck speed. A major research issue extraction of meaningful information from complex and huge source. Clustering one methods. The basic K-Mean Parallel partition clustering algorithms work by picking random starting centroids. parallel methods are investigated this using two different datasets with sizes 10000 5000, respectively. findings Simple alter throughout numerous runs or iterations, according to study, so iterations differ for each run execution. In some circumstances, algorithms’ outcomes always different, separate identify unique properties algorithm algorithm. Differentiating these features will improve cluster quality, lapsed time, iterations. Experiments designed show that considerably techniques. techniques also consistent; however, algorithm’s results vary run. Both 10,000 5000 item divided into ten subdatasets client systems. Clusters generated i.e., it takes all systems complete iteration (mentioned chapter number 4). first execution, Client No. 5 has longest elapsed (8 ms), whereas following 6 ms, total 12 ms technique. addition, reduce executions task.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparative Analysis of Hybrid K-Mean Algorithms on Data Clustering

Data clustering is a process of organizing data into certain groups such that the objects in the one cluster are highly similar but dissimilar to the data objects in other clusters. K-means algorithm is one of the popular algorithms used for clustering but k-means algorithm have limitations like it is sensitive to noise ,outliers and also it does not provides global optimum results. To overcome...

متن کامل

Clustering of Data Using K-Mean Algorithm

Clustering is associate automatic learning technique geared toward grouping a collection of objects into subsets or clusters. The goal is to form clusters that are coherent internally, however well completely different from one another. In plain words, objects within the same cluster ought to be as similar as potential, whereas objects in one cluster ought to be as dissimilar as potential from ...

متن کامل

Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering

Clustering in data mining is very important to discover distribution patterns and this importance tends to increase as the amount of data grows. It is one of the main analytical methods in data mining and its method influences its results directly. K-means is a typical clustering algorithm[3]. It mainly consists of two phases i.e. initializing random clusters and to find the nearest neighbour. ...

متن کامل

Performance Evaluation with K-Mean and K-Mediod in Data Mining

Data mining is the process of extraction of various types of information from different types of dataset that contains various types of attributes. Clustering is an approach that divides the whole information into different clusters. After processing of division of data values into different clusters centeroid have been computed. Cluster centeroid has been done on the basis of distance from oth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mobile Information Systems

سال: 2022

ISSN: ['1875-905X', '1574-017X']

DOI: https://doi.org/10.1155/2022/1277765